Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables
نویسنده
چکیده
منابع مشابه
Improved Construction of Negation-limited Circuits
A theorem of Markov states that any system of boolean functions on n variables may be computed by a boolean circuit containing at most dlog2(n + 1)e negation gates. We call such a circuit negation-limited . A circuit with inputs x1; : : : ; xn and outputs :x1; : : : ;:xn is called an inverter . Fischer has constructed negation-limited inverters of size O(n2 log n) and depth O(log n). Recently, ...
متن کاملProbabilistic Construction of Monotone Formulae for Positive Linear Threshold Functions
We extend Valiant's construction of monotone formulae for the majority function to obtain an eecient probabilistic construction of small monotone formulae for arbitrary positive linear threshold functions. We show that any positive linear threshold function on n boolean variables which has weight complexity q(n) can be computed by a monotone boolean formula of size O(q(n) 3:3 n 2): Our techniqu...
متن کاملA Note on Proofs of the Pigeonhole Principle in Deep Inference
It is known that the functional and onto variants of the propositional pigeonhole principle have polynomial-size proofs in the weakest deep inference systems. The unrestricted variant has quasipolynomial-size proofs when dag-like behaviour is permitted. Here we match that upper bound in systems free of dagness, and indeed other compression mechanisms, utilising a similar strategy to that of Ats...
متن کاملNew Algorithms for QBF Satisfiability and Implications for Circuit Complexity
We revisit the complexity of the satisfiability problem for quantified Boolean formulas. We show that satisfiability of quantified CNFs of size poly(n) on n variables with O(1) quantifier blocks can be solved in time 2n−n Ω(1) by zero-error randomized algorithms. This is the first known improvement over brute force search in the general case, even for quantified polynomial-sized CNFs with one a...
متن کاملA superlinear lower bound for undirected monotone contact networks computing T nn − 1
We show an Ω(n log log log n) lower bound on the size of undirected monotone contact networks computing the threshold function T n−1. This improves the lower bound of 2(n−1) due to Markov. We show that there exists a Boolean function of n variables that can be computed in linear size using directed monotone contact networks but that needs Ω(n log n) size on undirected monotone contact networks.
متن کامل